Publications related to 'Program Hybroscale' : Available at a href https: drupal.bio.ifi.lmu.de en softwareservices hybroscale index.html https: drupal.bio.ifi.lmu.de en softwareservices hybroscale index.html a
 
Order by:   Type | Year
           related to:
Associated keywords
Article (Journal)
1
photophotophoto
Celine Scornavacca, Simone Linz and Benjamin Albrecht. A fi rst step towards computing all hybridization networks for two rooted binary phylogenetic trees. In JCB, Vol. 19:1227-1242, 2012.
Keywords: agreement forest, explicit network, FPT, from rooted trees, phylogenetic network, phylogeny, Program Dendroscope, Program Hybroscale, reconstruction.
Note: http://arxiv.org/abs/1109.3268.
       
Toggle abstract
2
photophotophotophoto
Benjamin Albrecht, Celine Scornavacca, Alberto Cenci and Daniel H. Huson. Fast computation of minimum hybridization networks. In BIO, Vol. 28(2):191-197, 2012.
Keywords: explicit network, from rooted trees, minimum number, phylogenetic network, phylogeny, Program Dendroscope, Program Hybroscale, reconstruction.
Note: http://dx.doi.org/10.1093/bioinformatics/btr618.
       
Toggle abstract
3
photo
Benjamin Albrecht. Computing all hybridization networks for multiple binary phylogenetic input trees. In BMCB, Vol. 16(236):1-15, 2015.
Keywords: agreement forest, explicit network, exponential algorithm, FPT, from rooted trees, phylogenetic network, phylogeny, Program Hybroscale, Program PIRN, reconstruction.
Note: http://dx.doi.org/10.1186/s12859-015-0660-7.
       

Misc
4
photo
Benjamin Albrecht. Computing Hybridization Networks for Multiple Rooted Binary Phylogenetic Trees by Maximum Acyclic Agreement Forests. 2014.
Keywords: agreement forest, from rooted trees, minimum number, phylogenetic network, phylogeny, polynomial, Program Hybroscale, reconstruction.
Note: http://arxiv.org/abs/1408.3044.
       

5
photo
Benjamin Albrecht. Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests. 2015.
Keywords: agreement forest, explicit network, exponential algorithm, from rooted trees, phylogenetic network, phylogeny, Program Hybroscale, reconstruction, software.
Note: http://arxiv.org/abs/1512.05703.
       

6
photo
Benjamin Albrecht. Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees. 2015.
Keywords: agreement forest, explicit network, from rooted trees, phylogenetic network, phylogeny, Program Hybroscale, reconstruction, software.
Note: http://arxiv.org/abs/1512.05656.